The distant-2 chromatic number of random proximity and random geometric graphs
نویسندگان
چکیده
We are interested in finding bounds for the distant-2 chromatic number of geometric graphs drawn from different models. We consider two undirected models of random graphs: random geometric graphs and random proximity graphs for which sharp connectivity thresholds have been shown. We are interested in a.a.s. connected graphs close just above the connectivity threshold. For such subfamilies of random graphs we show that the distant-2-chromatic number is Θ(log n) with high probability. The result on random geometric graphs is extended to the random sector graphs defined in [3].
منابع مشابه
The Distant-l Chromatic Number of Random Geometric Graphs
A random geometric graph Gn is given by picking n vertices in R d independently under a common bounded probability distribution, with two vertices adjacent if and only if their l-distance is at most rn. We investigate the distant-l chromatic number χl(Gn) of Gn for l ≥ 1. Complete picture of the ratios of χl(Gn) to the chromatic number χ(Gn) are given in the sense of almost sure convergence.
متن کاملClique Colourings of Geometric Graphs
A clique colouring of a graph is a colouring of the vertices such that no maximal clique is monochromatic (ignoring isolated vertices). The least number of colours in such a colouring is the clique chromatic number. Given n points x1, . . . ,xn in the plane, and a threshold r > 0, the corresponding geometric graph has vertex set {v1, . . . , vn}, and distinct vi and vj are adjacent when the Euc...
متن کاملEfficient collection of sensor data via a new accelerated random walk
Motivated by the problem of efficiently collecting data from wireless sensor networks via a mobile sink, we present an accelerated random walk on Random Geometric Graphs. Random walks in wireless sensor networks can serve as fully local, lightweight strategies for sink motion that significantly reduce energy dissipation but introduce higher latency in the data collection process. In most cases ...
متن کاملRandom graph models for wireless communication networks
This thesis concerns mathematical models of wireless communication networks, in particular ad-hoc networks and 802.11 WLANs. In ad-hoc mode each of these devices may function as a sender, a relay or a receiver. Each device may only communicate with other devices within its transmission range. We use graph models for the relationship between any two devices: a node stands for a device, and an ed...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 106 شماره
صفحات -
تاریخ انتشار 2008